//
//  LinkList.cpp
//  408数据结构
//
//  Created by Cai Yuanhao on 2022/3/25.
//

#include "LinkList.hpp"

int main(){
    LinkList l;
    printf("input:");
    List_TailInsert(l);
    printlist(l);
    printf("input where do you want to del:");
    int loc,value;
    scanf("%d",&loc);
    del_lnode(l, loc);
    printlist(l);
    printf("input where do you want to insert and the value:");
    scanf("%d%d",&loc,&value);
    LinkList_Insert(l, loc, value);
    printlist(l);
    printf("input where do you want to see:");
    scanf("%d",&loc);
    printf("%d\n",GetElem(l, loc)->data);
    printf("input which do you want to see location:");
    scanf("%d",&value);
    printf("%d\n",LocateElem(l, value)->data);
    printf("now length:%d",getLen(l));
    return 0;
}
